Maximal serializability of iterated transactions
نویسندگان
چکیده
منابع مشابه
Specifying Strict Serializability of Iterated Transactions in Propositional Temporal Logic
We present an operator for a propositional linear temporal logic over infinite schedules of iterated transactions, which, when applied to a formula, asserts that any schedule satisfying the formula is serializable. The resulting logic is suitable for specifying and verifying consistency properties of concurrent transaction management systems, that can be defined in terms of serializability, as ...
متن کاملLogical Transactions and Serializability
The concept of logic databases can serve as a clear and expressive foundation of various kinds of information systems. However, classical logic languages refer to a single database state, whereas in modern information systems it is necessary to take dynamic behaviour into account. For this purpose, several update languages have been proposed, among them [AHV95, BK94, BK96, Che97, LHL95, MW88, M...
متن کاملSheth : Enforcing the Serializability of Multidatabase Transactions
| To enforce global serializability in a multi-database environment the multidatabase transaction manager must take into account the indirect (transitive) con-icts between multidatabase transactions caused by local transactions. Such connicts are diicult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these diicul...
متن کاملSerializability of Transactions in Software Transactional Memory
The use of two-phase locking (2PL) to enforce serialization in today’s Software Transactional Memory (STM) systems leads to poor performance for programs with long-running transactions and considerable data sharing. We propose the use of ConflictSerializability (CS) instead of 2PL. The use of CS allows transactions to complete when they would have either stalled or aborted with 2PL, potentially...
متن کاملSerializability of Nested Transactions in Multidatabases
The correctness of nested transactions for multidatabases dif fers from that of at transactions in that for nested transactions the execution order of siblings at each related site should also be consistent In this paper we rst propose a simple but powerful theory for the se rializability of nested transactions in multidatabases and then a tech nique called Nested Tickets Method for Nested Tran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90206-3